#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e3+1000;
typedef long long LL;
const LL mod=1e9+7;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL fac[maxn];
LL ksm(LL a,LL k){
   LL res=1;
   while(k>0){
      if(k&1) res=res*a%mod;
      k>>=1;
      a=a*a%mod;
   }return res%mod;
}
LL C(LL n,LL m){
     if(n>m) return 0;
     return fac[m]%mod*ksm(fac[n],mod-2)%mod*ksm(fac[m-n],mod-2)%mod;
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,m;cin>>n>>m;
   fac[0]=1;
   for(LL i=1;i<maxn;i++) fac[i]=fac[i-1]*i%mod;
   cout<<C(2*m,n+2*m-1)<<"\n";
   return 0;
}
